Jigsaw Percolation on Erdös-rényi Random Graphs
نویسنده
چکیده
We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erdös-Rényi random graphs. Let pppl and ppuz denote the probability that an edge exists in the respective people and puzzle graphs and define peff = ppplppuz, the effective probability. We show for constants c1 > 1 and c2 > π /6 and c3 < e −5 if min(pppl, ppuz) > c1 logn/n the critical effective probability peff, satisfies c3 < p c effn logn < c2.
منابع مشابه
Erdös-Rényi Random Graphs: The Giant Component
Recall that all the “Real-World” graphs we examined in Lecture 2 had one component containing a large constant fraction of the vertices. The second-largest component was smaller by many orders of magnitude. This property is shared by Erdös-Rényi random graphs and by many other graph models. In this lecture, we will see (mostly) why Erdös-Rényi random graphs have this property. The large compone...
متن کاملJ un 2 01 7 THE THRESHOLD FOR JIGSAW PERCOLATION ON RANDOM GRAPHS
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the ‘people’ graph and the ‘puzzle’ graph), and vertices merge to form components if they are joined by an edge of each graph. These components then merge to form larger componen...
متن کاملThe Threshold for Jigsaw Percolation on Random Graphs
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the ‘people’ graph and the ‘puzzle’ graph), and vertices merge to form components if they are joined by an edge of each graph. These components then merge to form larger componen...
متن کاملErdös-Rényi Random Graphs: Warm Up
In this lecture we will introduce the Erdös-Rényi model of random graphs. Erdös and Rényi did not introduce them in an attempt to model any graphs found in the real world. Rather, they introduced them because they are the source of a lot of interesting mathematics. In fact, these random graphs have many properties that we do not know how to obtain through any efficient explicit construction of ...
متن کاملOn large deviation properties of Erdös-Rényi random graphs
It is well-known that typical properties of random graphs can be derived from the q → 1 limit of the Potts model of statistical mechanics. We show that, additionally, the Legendre transform of the Potts free energy with respect to ln q allows to study large deviation properties of the random graph ensemble characterizing graphs with an atypical number of components. We also demonstrate how the ...
متن کامل